Using First-Order Logic to Reason about Policies

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using First-Order Logic to Reason about Submodule Construction1

We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving"; and in the context of s...

متن کامل

Using First-Order Logic to Reason about Submodule Construction

We consider the following problem: For a system consisting of two components, the behavior of one component is known as well as the desired global behavior. What should be the behavior of the second component such that the behavior of the composition of the two conforms to the desired behavior ? This problem has been called "submodule construction" or "equation solving”. Solutions to this probl...

متن کامل

Using Recursive Types to Reason about Hardware in Higher Order Logic

The expressive power of higher order logic makes it possible to deene a wide variety of data types within the logic and to prove theorems that state the properties of these types concisely and abstractly. This paper describes how such deened data types can be used to support formal reasoning in higher order logic about the behaviour of hardware designs.

متن کامل

Using Logic Programs to Reason about Infinite Sets

Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert codes for various infinite sets. Depending on the form of atoms allowed in the bodies of clauses we obtain a variety of completeness results for various classes of arithmetic sets of integers.

متن کامل

Using Linear Logic to Reason about Sequent Systems

Linear logic can be used as a meta-logic for the specification of some sequent calculus proof systems. We explore in this paper properties of such linear logic specifications. We show that derivability of one proof system from another has a simple decision procedure that is implemented simply via bounded logic programming search. We also provide conditions to ensure that an encoded proof system...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Information and System Security

سال: 2008

ISSN: 1094-9224,1557-7406

DOI: 10.1145/1380564.1380569